Exceptions in the Rewriting Calculus
نویسندگان
چکیده
In the context of the rewriting calculus, we introduce and study an exception mechanism that allows us to express in a simple way rewriting strategies and that is therefore also useful for expressing theorem proving tactics. This gives us the ability to simply express the semantics of the first tactical and to describe in full details the expression of conditional rewriting.
منابع مشابه
An intuitionistic λ-calculus with exceptions
We introduce a typed λ-calculus which allows the use of exceptions in the ML style. It is an extension of the system AF2 of Krivine and Leivant ((Krivine, 1990a), (Leivant, 1983)). We show its main properties : confluence, strong normalization and weak subject reduction. The system satisfies the “the proof as program” paradigm as in AF2 . Moreover, the underlined logic of our system is intuitio...
متن کاملA Simple Calculus of Exception Handling
We introduce a simply-typed λ-calculus (λexn) featuring an ML-like exception handling mechanism. This calculus, whose type system corresponds to classical logic through the Curry-Howard isomorphism, satifies several interesting properties: among other, Church-Rosser, subject reduction, and strong-normalisation. Moreover, its typing system ensures that the reduction of well-typed expressions can...
متن کاملThe Rewriting Calculus as a Combinatory Reduction System
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calculus. The combination of these two latter formalisms has been already handled either by enriching first-order rewriting with higher-order capabilities, like in the Combinatory Reduction Systems (crs), or by adding to λ-cal...
متن کاملSharing in the Graph Rewriting Calculus
The graph rewriting calculus is an extension of the ρ-calculus, handling graph like structures, with explicit sharing and cycles, rather than simple terms. We study a reduction strategy for the graph rewriting calculus which is intended to maintain the sharing in the terms as long as possible. We show that the corresponding reduction relation is adequate w.r.t. the original semantics of the gra...
متن کاملA Rewriting Calculus for Multigraphs with Ports
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of these structures is expressed with multigraph rewrite rules and a multigraph rewriting relation. Then we encode the multigraphs and multigraph rewriting using algebraic terms and term rewriting to provide an operational ...
متن کامل